A Result on Formal Linearity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A formal study of linearity axioms for fuzzy orderings

This contribution is concerned with a detailed investigation of linearity axioms for fuzzy orderings. Different existing concepts are evaluated with respect to three fundamental correspondences from the classical case—linearizability of partial orderings, intersection representation, and one-to-one correspondence between linearity and maximality. As a main result, we obtain that it is virtually...

متن کامل

A short remark on the result of Jozsef Sandor

It is pointed out that, one of the results in the recently published article, ’On the Iyengar-Madhava Rao-Nanjundiah inequality and it’s hyperbolic version’ [3] by J´ozsef S´andor is logically incorrect and new corrected result with it’s proof is presented.

متن کامل

A note on the second linearity critique

As I say in the paper, there is a second linearity or knife-edge or razor-edge critique. First popularized in a short review article by Jones (1999), and further elaborated in Jones (2005), it consists of the claim that to sterilize the (strong) scale effect the models proposed by DinopoulosThompson (1998), Peretto (1998), Young (1998), and Howitt (1999), assume that the mass of products/firms,...

متن کامل

On a result of

where the coecients a; b; c; m are random and satisfy some conditions to be speci®ed later, the function u ˆ u…x; t; x† is supposed to be nonnegative, u; u are the ®rst and second derivatives of u with respect to x 2 R, and du is Itoà 's stochastic di€erential of u with respect to t. Actually, equation (0.1) has to be understood in a certain generalized sense since, for instance, the series Pr...

متن کامل

Formal Correctness of Result Checking for Priority Queues

We formally prove the correctness of the time super-e cient result checker for priority queues, which is implemented in LEDA [17]. A priority queue is a data structure that supports insertion, deletion and retrieval of the minimal element, relative to some order. A result checker for priority queues is a data structure that monitors the input and output of the priority queue. Whenever the user ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2000

ISSN: 0021-8693

DOI: 10.1006/jabr.1999.8186